Search results for "Planar straight-line graph"

showing 2 items of 2 documents

Dynamic 2- and 3-connectivity on planar graphs

1992

We study the problem of maintaining the 2-edge-, 2-vertex-, and 3-edge-connected components of a dynamic planar graph subject to edge deletions. The 2-edge-connected components can be maintained in a total of O(n log n) time under any sequence of at most O(n) deletions. This gives O(log n) amortized time per deletion. The 2-vertex- and 3-edge-connected components can be maintained in a total of O(n log2n) time. This gives O(log2n) amortized time per deletion. The space required by all our data structures is O(n).

Amortized analysisBook embeddingPlanar straight-line graph1-planar graphPlanar graphCombinatoricssymbols.namesakePathwidthChordal graphTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYOuterplanar graphData_FILESsymbolsMathematicsofComputing_DISCRETEMATHEMATICSMathematics
researchProduct

Gray coding cubic planar maps

2016

International audience; The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize beta-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps. (C) 2015 Elsevier B.V. All rights reserved.

QA75[ INFO ] Computer Science [cs]General Computer SciencePlanar straight-line graph0102 computer and information sciences02 engineering and technologyComputer Science::Computational GeometryCubic non-separable planar map01 natural sciencesTheoretical Computer ScienceGray codeCombinatoricssymbols.namesakePlanarPlanar mapbeta(01)-Tree0202 electrical engineering electronic engineering information engineering[INFO]Computer Science [cs]Gray codeMathematicsDiscrete mathematicsBicubic planar map3-Connected cubic planar mapPlanar graph010201 computation theory & mathematicsDescription treesymbolsBicubic interpolation020201 artificial intelligence & image processingMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct